Schedule-Clock-Tree Routing for Semi-Synchronous Circuits∗∗
نویسندگان
چکیده
It is known that the clock-period can be shorter than the maximum of signal-delays between registers if the clock arrival time to each register is properly scheduled. The algorithm to design an optimal clock-schedule was given. In this paper, we propose a clock-tree routing algorithm that realizes a given clock-schedule using the Elmore-delay model. Following the deferred-merge-embedding (DME) framework, the algorithm generates a topology of the clock-tree and simultaneously determines the locations and sizes of intermediate buffers. The experimental results showed that this method constructs a clocktree with moderate wire length for a random layout of scheduled registers. Notably, the required wire length for a gentle layout of scheduled registers was shown to be almost equal to that of zero-skew clock-trees. key words: clock-tree, clock-scheduling, semi-synchronous circuit, deferred-merge embedding
منابع مشابه
Clock Period Minimization of Semi-Synchronous Circuits by Gate-Level Delay Insertion
A semi-synchronous circuit is a circuit in which every register is ticked by a clock periodically, but not necessarily simultaneously. A feature of semi-synchronous circuits is that the minimum delay between registers may be critical with respect to the clock period of the circuit. In this paper, we discuss a delay insertion method which makes such a semi-synchronous circuit faster. The maximum...
متن کاملCombinatorial Aspects of Lower Power Clock Layout Synthesis in VLSI Synchronous Circuits
In a synchronous VLSI design, carrying the heaviest load and switching at high frequency , clock distribution is a major source of power dissipation. Also, circuit speed and chip area have been an important consideration and the delay on the longest path (phase delay) through combinational logic, and the maximum skew among the synchronizing components should be minimized. There have been active...
متن کاملClock-Routing Driven Layout Methodology for Semi-Synchronous Circuit Design
The most expensive part in modern VLSIs is the clockdistribution network where the clock is assumed to be distributed periodically and simultaneously. While, in the semi-synchronous system, the clock is assumed to be distributed periodically, but not necessarily simultaneously. In this framework, we propose a new design methodology which maximizes the performance of a circuit subject to the min...
متن کاملMatching-based methods for high-performance clock routing
Minimizing clock skew is important in the design of high performance VLSI systems. We present a general clock routing scheme that achieves very small clock skews while still using a reasonable amount of wirelength. Our routing solution is based on the construction of a binary tree using geometric matching. For cell-based designs, the total wirelength of our clock routing tree is on average with...
متن کاملGated clock routing for low-power microprocessor design
This paper presents a zero-skew gated clock routing technique for VLSI circuits. Gated clock trees include masking gates at the internal nodes of the clock tree, which are selectively turned on and off by the gate control signals during the active and idle times of the circuit modules to reduce the switched capacitance of the clock tree. We construct a clock tree topology based on the locations...
متن کامل